Fast generalized decision feedback equalizer precoder implementation for multi-user multiple-input multiple-output wireless transmission systems

ABSTRACT

A technique is used to realize a generalized decision feedback equalizer (GDFE) Precoder for multi-user multiple-input multiple-output (MU-MIMO) systems, which significantly reduces the computational cost while resulting in no capacity loss. The technique is suitable for improving the performance of various MU-MIMO wireless systems including future 4G cellular networks. In one embodiment, a method for configuring a GDFE precoder in a base station of a MU-MIMO wireless system having k user terminals, each user terminal having associated therewith a feedforward filter. The method comprises computing a filter matrix C using one of a plurality of alternative formulas of the invention; and, based on the computation of the filter matrix C, computing a transmit filter matrix B for a transmit filter used to process a symbol vector obtained after a decision feedback equalizing stage of the GDFE precoder, a feedforward filter matrix F, and an interference pre-cancellation matrix G.

This application is a continuation of Ser. No. 13/447,415, filed Apr. 16, 2012, which is a continuation of Ser. No. 12/401,711, now U.S. Pat. No. 8,175,189 filed Mar. 11, 2009, the entire disclosures of which are incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates to multiple-input multiple-output (MIMO) communications systems. More specifically, the present invention relates to precoder configuration in MIMO systems.

BACKGROUND OF THE INVENTION

It is well known that a Generalized Decision Feedback Equalizer (GDFE) based precoder provides the optimal capacity solution for Multi-user Multiple-Input Multiple-Output (MU-MIMO) wireless systems. However, the computational cost of determining various filters associated with the GDFE Precoder is often prohibitive and is not suitable for many practical systems.

There are several known Precoding techniques which can enable a Base Station (BS) equipped with multiple antennas to send simultaneous data streams to multiple user terminals (UTs) in order to optimize system capacity. In general, Precoding for a MU-MIMO system aims to optimize a certain criterion such as system capacity or bit error rate. Selected references are noted below, together with a description of relevant aspects of the techniques proposed therein.

Q. H Spencer, A. L. Swindlehurst, and M. Haardt, “Zero-forcing methods for downlink spatial multiplexing in multi-user MIMO channels”, IEEE Transactions on Signal Processing, pp. 461-471, February 2004 [1] describes a linear precoding technique, known as Block Diagonalization (BD), which separates out the data streams to different UTs by ensuring that interference spans the Null Space of the victim UT's channel. The BD technique diagonalizes the effective channel matrix so as to create multiple isolated MIMO sub-channels between the BS and the UTs. Although this scheme is simple to implement, it limits system capacity somewhat.

C. Windpassinger, R. F. H Fischer, T. Vencel, and J. B Huber, “Precoding in multi-antenna and multi-user communications”, IEEE Transactions on Wireless Communications, pp. 1305-1316, July 2004[2] describes a non-linear precoding scheme known as Tomlinson-Harashima Precoding (THP). This scheme relies on successive interference pre-cancellation at the BS. A modulo operation is used to ensure that transmit power is not exceeded. Different from BD, THP triangularizes the effective channel matrix and provides somewhat higher system capacity when compared to BD.

In W. Yu, “Competition and Cooperation in Multi-User Communication Environments”, PhD Dissertation, Stanford University, February 2002[3] and W. Yu and J. Cioffi, “Sum capacity of Gaussian vector broadcast channels”, IEEE Transactions on Information Theory, pp. 1875-1892, September 2004 [4], Wei Yu introduced the GDFE Precoder and showed that it achieves a high degree of system capacity. The basic components of this scheme are illustrated in FIG. 1. The GDFE Precoder includes an interference pre-cancellation block 101. Similar to the THP precoding scheme discussed in reference [2] above, the interference pre-cancellation helps to ensure that the symbol vector encoded at the k^(th) step will suffer from the interference from (k−1) symbol vectors only. Information symbols u are processed by the interference pre-cancellation block 101 to produce filtered vector symbols x.

The filtered vector symbols x are then passed through a transmit filter 103 denoted by matrix B to produce transmitted signals y. In reference [3] and [4], a technique based on the covariance matrix (S_(zz)) corresponding to “Least Favorable Noise” is proposed to compute the GDFE Precoder components. Although, this technique achieves a high degree of system capacity, the computational cost of determining the GDFE Precoder components is effectively prohibitive for a real-time implementation required by most practical systems.

X. Shao, J. Yuan and P. Rapajic, “Precoder design for MIMO broadcast channels”, IEEE International Conference on Communications (ICC), pp. 788-794, May 2005 [5] proposes a different precoding technique which achieves a capacity close to the theoretical maximum system capacity. The proposed method is computationally less complex compared to the GDFE Precoder technique. However, the proposed method allocates equal power to all data streams, which may not be an effective technique for practical systems using a finite number of quantized bit-rates. Also, the proposed technique is limited to invertible channel matrices, which may not always be the case.

N. Jindal, W. Rhee, S. Vishwanath, S. A. Jafar, and A. Goldsmith, “Sum Power Iterative Water-filling for Multi-Antenna Gaussian Broadcast Channels”, IEEE Transactions on Information Theory, pp. 1570-1580, April 2005 [6] derives a very useful result referred to as the MAC/BC (multiple access channel/broadcast channel) duality; and Wei Yu, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 66, “Advances in Network Information Theory,” pp. 159-147 [7] develops the concept of least favorable noise.

SUMMARY OF THE INVENTION

A technique is used to realize a GDFE Precoder for multi-user (MU) MIMO systems, which significantly reduces the computational cost while resulting in no capacity loss. The technique is suitable for improving the performance of various MU-MIMO wireless systems including presently planned future “4G” cellular networks.

The described implementation of a GDFE Precoder relaxes the requirement for knowledge of the covariance matrix (S_(zz)) corresponding to “Least Favorable Noise.” This is the key component in conventional design of a GDFE Precoder and requires extensive computational cost. It also provides a uniform framework for realizing a GDFE Precoder. Unlike conventional GDFE Precoder design, the proposed method does not require channel reduction when the Input Covariance Matrix (S_(xx)) for downlink channel is rank deficient.

The described implementation of a GDFE Precoder achieves significant improvement in computational cost over conventional GDFE Precoders.

An aspect of the present invention is directed to a method for configuring a generalized decision feedback equalizer (GDFE) based precoder in a base station of a multi-user multiple-input multiple-output (MU-MIMO) wireless system having k user terminals (UTs), each user terminal (UT) having associated therewith a feedforward filter. The method comprises computing a filter matrix C using one of a plurality of alternative formulas of the invention as described below; and, based on the computation of the filter matrix C, computing a transmit filter matrix B for a transmit filter used to process a symbol vector obtained after a decision feedback equalizing stage of the GDFE precoder, computing the feedforward filter matrix F, and computing the interference pre-cancellation matrix G.

Another aspect of the invention is directed to a GDFE based precoder in a base station of a MU-MIMO wireless system having k user terminals, each user terminal having associated therewith a feedforward filter. The GDFE precoder comprises a feedforward path; a feedback path; and an interference pre-cancellation block denoted by I-G disposed in the feedback path, I being an identity matrix, G being an interference pre-cancellation matrix. A feedforward filter matrix F is related to the interference pre-cancellation matrix by a novel expression as described below.

Yet another aspect of the invention is directed to a GDFE based precoder in a base station of a MU-MIMO wireless system having k user terminals, each user terminal having associated therewith a feedforward filter. The GDFE precoder comprises a feedforward path; a feedback path; and an interference pre-cancellation block denoted by I-G disposed in the feedback path, I being an identity matrix, G being an interference pre-cancellation matrix. The interference pre-cancellation matrix G in the interference pre-cancellation block is determined by computing a filter matrix C using one of a plurality of alternative formulas of the invention as described below; and, based on the computation of the filter matrix C, computing a transmit filter matrix B for a transmit filter used to process a symbol vector obtained after a decision feedback equalizing stage of the GDFE precoder, computing the feedforward filter matrix F, and computing the interference pre-cancellation matrix G.

Additional features and benefits of the present invention will become apparent from the detailed description, figures and claims set forth below.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be understood more fully from the detailed description given below and from the accompanying drawings of various embodiments of the invention, which, however, should not be taken to limit the invention to the specific embodiments, but are for explanation and understanding only.

FIG. 1 is a block diagram of a known GDFE Precoder;

FIG. 2 is a block of a communications system using GDFE Precoding;

FIG. 3 is a block diagram of configuring feedforward filter of GDFE Precoder;

FIG. 4 is a flowchart of configuring a GDFE Precoder;

DETAILED DESCRIPTION

In the following, the system model and relevant prior art are first described in sub-section A, followed in sub-section B by a description of implementations of a GDFE Precoder.

Those of ordinary skill in the art will realize that the following detailed description of the present invention is illustrative only and is not intended to be in any way limiting. Other embodiments of the present invention will readily suggest themselves to such skilled persons having the benefit of this disclosure. It will be apparent to one skilled in the art that these specific details may not be required to practice to present invention. In other instances, well-known circuits and devices are shown in block diagram form to avoid obscuring the present invention. In the following description of the embodiments, substantially the same parts are denoted by the same reference numerals.

First, the system model and notations used thereafter are set forth. Let the base station (BS) have N antennas and let there be K user terminals (UTs) with L_(k) antennas each. The sum of antennas at UTs is denoted as L=Σ_(k=1) ^(K)L_(k). Let H_(k) denote the channel gain matrix of dimensions {L_(k)×N} between the BS and the k^(th) UT. The combined channel gain matrix between the BS and the K UTs is of dimension {L×N} and is given by H=[H₁ ^(T) H₂ ^(T) . . . H_(K) ^(T)]^(T), where the superscript ^(T) denotes the matrix transpose.

Let u_(k) denote the input symbol vector destined for the k^(th) UT, so that the stacked input vector can be represented as u=[u₁ ^(T) u₂ ^(T) . . . u_(K) ^(T)]^(T). The length of u is assumed not to exceed the number of antennas at the BS. Also, assume the additional constraint that S_(uu)=E[uu^(H)]=I, where E[.] indicates the time average of its argument, the superscript H denotes the conjugate transpose and I denotes the identity matrix.

A.1 DEFINITIONS

Referring to FIG. 2, a functional block diagram is shown of a MU-MIMO system having a base station 210 and user terminals 220 ₁-220 _(k). Each user terminal has associated therewith a feedforward filter F₁-F_(k). Communications occur through a channel 231 represented by a channel matrix H. The base station includes a GDFE Precoder including a feedforward path and a feedback path. In the feedforward path, a modulo unit 233 produces a stream of filtered vector symbols X, which are filtered by a transmit filter 235 to produce a transmitted signal stream y. In the feedback path, the symbols X are fed back through an interference pre-cancellation block 237, represented by an interference pre-cancellation matrix G subtracted from the identity matrix I. A stream of user symbols u has subtracted therefrom an output signal of the interference pre-cancellation block 237, with the result being applied to the modulo unit 233.

Other aspects/parameters related to this system model are described below:

1). Interference Pre-Cancellation Matrix (G): This matrix is used at the transmitter at Interference Pre-cancellation Stage of the GDFE Precoder as shown in FIG. 2. The main purpose of this matrix is to process input symbol vector u for interference pre-cancellation purposes. Its structure is that of an Upper Right Triangular matrix with block diagonal sub-matrices being identity matrices each of size a_(k).

2). Input Covariance Matrix for Downlink Channel (S_(xx)): It is defined as S_(xx)=E[xx^(H)] and satisfies the transmit power constraint, i.e., trace(S_(xx))≦P_(t), where P_(t) denotes the total available transmit power and trace(.) indicates the sum of diagonal elements of the matrix argument. The input covariance matrix for the downlink channel represents dependencies of symbols transmitted from different ones of said N transmit antennas; a sum of diagonal matrix elements represents an intended total transmit power from the N transmit antennas. In the following text, S_(xx) will be represented using its Eigen Value Decomposition (EVD) as: S _(xx) =VΣV ^(H)  (1) where V is a unitary matrix and Σ is a diagonal matrix with non-negative entries.

3). Transmit Filter (B): This matrix is used to process the symbol vector x obtained after the DFE stage of GDFE Precoder as shown in FIG. 2. It is denoted by the following equation: B=VΣ ^(1/2) M  (2) where M is a unitary matrix and the matrices {V,Σ} are same as defined in (1).

4). Least Favorable Noise Covariance Matrix (S_(zz)): This may be regarded as the noise covariance matrix that results in the minimum system capacity when full coordination among all UTs is assumed. This is a positive definite Hermitian Matrix whose block diagonal sub-matrices are identity matrices of size a_(k). This is defined in a similar fashion to that shown in Eq. (67) of reference [4].

5). Input Covariance Matrix for Equivalent Uplink Channel (D): It is defined similar to the Equation (3.6) of reference [7] as the correlation among the symbols of the input vector for the equivalent Uplink/Medium Access Channel (MAC) with channel matrix H^(H). The structure of matrix D is that of a block diagonal matrix and satisfies the transmit power constraint, i.e., trace(D)≦P_(t), where P_(t) denotes the total available transmit power. Each block diagonal sub-matrix of D represents the input covariance matrix for a particular UT in the Uplink channel. A capacity optimal D can be computed using the methodology presented in reference [6].

A.2 TRANSMITTER PROCESSING

As shown in FIG. 2, the GDFE Precoder includes an interference pre-cancellation block denoted by I-G, where G has the structure of a Block Upper Right Triangular matrix. Similar to the THP precoding scheme of reference [2], the triangular structure of the feedback matrix G helps to ensure that the symbol vector encoded at the k^(th) step will suffer from the interference from (k−1) symbol vectors only. The x_(k) ^(th) sub-vector of x=[x₁ ^(T) x₂ ^(T) . . . x_(K) ^(T)]^(T) is generated using the following relationship:

$\begin{matrix} {x_{k} = {\left( {u_{k} - {\sum\limits_{m = {k + 1}}^{K}{G_{km}x_{m}}}} \right) + \alpha_{k}}} & (3) \end{matrix}$ where G_(km) denotes the sub-matrix of G required to pre-cancel interference due to the vector symbol x_(m) from x_(k). These sub-vectors are generated in the reverse order, with x_(K) being the first generated vector and x₁ being the last one. An example of the structure of the matrix G for a 3 UT scenario is shown below

$\begin{matrix} {G = \begin{bmatrix} I & G_{12} & G_{13} \\ 0 & I & G_{23} \\ 0 & 0 & I \end{bmatrix}} & (4) \end{matrix}$

In this particular example, x₃ is generated first, followed by x₂ from which interference due to x₃ is pre-subtracted using the sub-matrix G₂₃. Lastly, x₁ is generated after pre-subtraction of interference due to x₂ and x₃. Also, each complex element of vector α_(k) in (3) is chosen from the following set: A={2√{square root over (S)}(p ₁ +jp _(Q))|p _(I) ,p _(Q)ε{±1,±3, . . . ,±(√{square root over (S)}−1)}}, where S is the constellation size.  (5)

The elements of α_(k) are chosen such that the elements of the resulting vector x_(k) are bounded by the square region of width 2√{square root over (S)}. This mechanism, while allowing for interference pre-cancellation, also limits the total transmit power.

The vector x is then passed through a transmit filter B to yield a vector y given by the following relationship: y=Bx  (6)

The vector y is transmitted by mapping its element to the respective antenna elements of the Base Station.

A.3 RECEIVER PROCESSING

Let the feedforward filter employed by k^(th) UT be denoted by F_(k), which is a matrix of dimension {a_(k)×L_(k)} where a_(k) denotes the length of vector u_(k). Now, the received baseband vector corresponding to the k^(th) UT is given by r _(k) =F _(k) HBx+F _(k) n _(k)  (7) where x is the symbol vector derived from input symbol vector u after an interference pre-cancellation step as shown in FIG. 2. The filter B indicates the transmit filter, and noise at k^(th) UT is denoted by n_(k). The stacked received basedband vector corresponding to all K UTs can be represented as r=FHBx+Fn  (8) where, F=diag(F₁, F₂, . . . F_(K)) is a block diagonal matrix representing the feedforward filter and n represents stacked noise vector.

In the following, different methods are presented to compute matrices B, G and F as defined earlier. One method assumes the knowledge of S_(zz) whereas other methods provide ways to compute GDFE matrices without any knowledge of S_(zz).

B. COMPUTATION OF GDFE PRECODER MATRICES

Unlike prior methods, in the present method the feedforward filter, F, is expressed as: F=GM ^(H)(HVΣ ^(1/2))^(H) [HS _(xx) H ^(H) +S _(zz)]⁻¹  (9) where the “Least Favorable Noise,” S_(zz), may be regarded as the noise covariance matrix that results in the minimum system capacity when there is full coordination among all UTs. S_(zz) may be computed using the technique described in reference [4]. The matrices {V,Σ} are same as defined in (1).

The input covariance matrix S_(xx) for the downlink channel may be computed by first computing the input covariance matrix D for the equivalent Uplink/Medium Access Channel (MAC) with channel gain matrix H^(H). The capacity achieved by the proposed GDFE method is the same as the capacity achieved by the choice of D for the equivalent Uplink channel. A capacity optimal D can be computed using the methodology presented in reference [6]. The input covariance matrix S_(x) for the downlink channel can then be computed using the following equation given in reference [7]:

$\begin{matrix} {S_{xx} = \frac{I - \left\lbrack {{H^{H}{DH}} + I} \right\rbrack^{- 1}}{\lambda}} & (10) \end{matrix}$ where for a given total transmit power P_(t), the scalar variable λ can be computed as: λ=trace(I−[H ^(H) DH+I] ⁻¹)/P _(t)  (11)

Next, referring to FIG. 4, a filter matrix C is defined as: C=(HVΣ ^(1/2))^(H) [HS _(xx) H ^(H) +S _(zz)]⁻¹  (12) (step 403 in FIG. 4). Now, the feedforward filter F can be represented as F=GM ^(H) C  (13)

It can be noted that F is Block Diagonal and G is Block Upper Right Triangular with Identity matrices forming its diagonal block. Given that M is unitary matrix; pre-multiplication of M^(H) with C must result in a Block Upper Right Triangular matrix R. Hence, M can be obtained using the QR decomposition (QRD) of C as C=MR  (14) (step 406). It must be noted that the QRD is performed in such a way that all non-zero columns of C which span the same vector space contribute to only one column vector in matrix M. Computation of matrices B, G and F is then performed as follows: Compute B=VΣ ^(1/2) M(step 407)  (15) Set F=BlockDiagonal(R)(step 408)  (16) The BlockDiagonal(.) function extracts submatrices F₁, F₂ . . . , F_(K) of size {a_(k)×L_(k)} from the block diagonals of the matrix R as illustrated in FIG. 3. The number of symbols, a_(k), allotted to the k^(th) UT equals the rank of F_(k). Compute G=FR ^(\)(step 409)  (17) where the superscript \ denotes the Moore-Penrose Generalized Inverse.

B.1 Alternate Methods to Compute C

In this method, the use of S_(zz) is avoided for computing the matrix C and subsequently other dependent matrices of GDFE Precoder.

The expression (12) is rewritten as: C[HS _(xx) H ^(H) +S _(zz)]=(HVΣ ^(1/2))^(H)  (18)

Next, the expression H^(H)[HS_(xx)H^(H)+S_(zz)]⁻¹H=λI given in reference [7] is alternatively expressed as: [HS _(xx) H ^(H) +S _(zz)]=λ⁻¹ HH ^(H)  (19) where λ is computed using (11).

Next, the expression in (19) is substituted in (18) to obtain the following equality CHH ^(H)=λ(VΣ ^(1/2))^(H) H ^(H)  (20)

Now, for a channel matrix H whose rank is greater than or equal to its number of rows, the matrix C can be uniquely determined as: C=λ(VΣ ^(1/2))^(H) H ^(\)  (21) (step 404 in FIG. 4) where the superscript \ denotes the Moore-Penrose Generalized Inverse. Furthermore, omitting the scalar operation 2 in above expression does not alter the performance of GDFE Precoder. Therefore, following expression can also be used for channels whenever the rank of H is greater than or equal to the number of rows in H (step 410 in FIG. 4): C=(VΣ ^(1/2))^(H) H ^(\)  (22)

For the channel matrix H whose rank is less than its number of rows, the matrix C can be determined by solving the following limit:

$\begin{matrix} {C = {{\lambda\left( {V\;\Sigma^{1/2}} \right)}^{\dagger}{\lim\limits_{X\rightarrow 0}{S_{xx}\left\lbrack {H\mspace{14mu} X} \right\rbrack}^{\dagger}}}} & (23) \end{matrix}$ where X is an arbitrary matrix with same number of rows as H. The number of columns in X is chosen so that the rank of the resulting matrix [H X] is greater than or equal to the number of rows in H. Here, the matrix S_(zz) denotes the input covariance matrix for the effective downlink channel matrix [H X].

The expression in (23) can be simplified using (10) along with some matrix manipulations as C=(HVE ^(1/2))^(\) [I−(HH ^(H) D+I)⁻¹]  (24)

This expression can be further simplified using matrix inversion identities as C=√{square root over (Σ^(\))}(HV)^(\) HV[I−λΣ]V ^(H) H ^(H) D  (25) Here the matrix product (HV)^(\)HV in (25) is equal to a diagonal matrix with leading diagonal entries being 1 and the rest of trailing entries being 0. The number of diagonal entries equal to 1 is same as the rank of H. Observing that the rank of the matrix product HV is always greater than or equal to that of Sigma, it can be ensured that the number of trailing zeros in the matrix product (HV)^(\)HV are always less than or equal to those in Σ.

Hence the above expression in (25) can be further simplified as C=[√{square root over (Σ^(\))}−λ√{square root over (Σ)}]V^(H) H ^(H) D  (26) (step 405 in FIG. 4). Here it should be noted that expressions (24), (25) and (26) can be used for any arbitrary channel matrix H. However when the rank of channel matrix is greater than or equal to its number of rows, expression in (21) or (22) may be used because of possible computational efficiency.

B.2 NUMERICAL EXAMPLES Example-1 Using Eq. (12) to Compute C

The following numerical example illustrates the computation of various matrices involved in the design of GDFE Precoder for the case when S_(zz) is known beforehand, i.e. C is computed using equation (12).

Consider a BS with 4 antennas and 2 users with 2 antennas each, so that channel matrices associated with both the users are of dimension 2×4. Let the overall channel matrix be the following:

$\begin{matrix} {H = {\begin{bmatrix} H_{1} \\ H_{2} \end{bmatrix} = \begin{bmatrix} 0.8156 & 1.1908 & {- 1.6041} & {- 0.8051} \\ 0.7119 & {- 1.2025} & 0.2573 & 0.5287 \\ 1.2902 & {- 0.0198} & {- 1.0565} & 0.2193 \\ 0.6686 & {- 0.1567} & 1.4151 & {- 0.9219} \end{bmatrix}}} & (27) \end{matrix}$

For fixed transmit power of 20, the optimal input covariance matrix S_(xx) for the downlink channel can be computed by first computing the optimal input covariance matrix D for the equivalent Uplink/MAC channel as described in [6] and then using the equation (10):

$\begin{matrix} {S_{xx} = \begin{bmatrix} 6.0504 & {- 0.8646} & {- 0.5495} & {- 0.9077} \\ {- 0.8646} & 4.0316 & {- 1.5417} & {- 2.4559} \\ {- 0.5495} & {- 1.5417} & 5.7918 & {- 1.3812} \\ {- 0.9077} & {- 2.4559} & {- 1.3812} & 4.1262 \end{bmatrix}} & (28) \end{matrix}$

The Eigen Value Decomposition (EVD) of S_(xx) can be computed as:

$\begin{matrix} {{V = \begin{bmatrix} {- 0.1548} & 0.2203 & 0.9335 & 0.2367 \\ {- 0.5546} & 0.3955 & {- 0.3485} & 0.6438 \\ 0.8032 & 0.4608 & {- 0.0697} & 0.3711 \\ 0.1528 & {- 0.7634} & 0.0468 & 0.6259 \end{bmatrix}}{and}} & (29) \\ {\Sigma = \begin{bmatrix} 6.6995 & 0 & 0 & 0 \\ 0 & 6.4942 & 0 & 0 \\ 0 & 0 & 6.3688 & 0 \\ 0 & 0 & 0 & 0.4375 \end{bmatrix}} & (30) \end{matrix}$

Also, the “Least Favorable Noise” covariance matrix S_(zz) may be computed using the technique described in reference [4] as

$\begin{matrix} {S_{zz} = \begin{bmatrix} 1.0000 & 0 & 0.4726 & 0.0573 \\ 0 & 1.0000 & 0.5846 & 0.0867 \\ 0.4726 & 0.5846 & 1.0000 & 0 \\ 0.0573 & 0.0867 & 0 & 1.0000 \end{bmatrix}} & (31) \end{matrix}$

Following the details outlined in Method-I, the following QR Decomposition is first computed

$\begin{matrix} \begin{matrix} {C = {\left( {{HV}\;\Sigma^{1/2}} \right)^{H}\left\lbrack {{{HS}_{xx}H^{H}} + S_{zz}} \right\rbrack}^{- 1}} \\ {= \underset{\underset{M}{︸}}{\begin{bmatrix} {- 0.3746} & 0.6016 & 0.4650 & {- 0.5306} \\ 0.3008 & {- 0.5290} & 0.0216 & {- 0.7932} \\ {- 0.0990} & 0.3554 & {- 0.8802} & {- 0.2985} \\ {- 0.8715} & {- 0.4815} & {- 0.0924} & {- 0.0118} \end{bmatrix}}} \\ {\underset{\underset{R}{︸}}{\begin{bmatrix} 0.2669 & 0.2024 & {- 0.2817} & {- 0.0087} \\ 0 & 0.2413 & {- 0.0786} & {- 0.0562} \\ 0 & 0 & {- 0.2281} & {- 0.0542} \\ 0 & 0 & 0 & {- 0.2050} \end{bmatrix}}} \end{matrix} & (32) \end{matrix}$

Next, the method computes the transmit filter matrix B as

$\begin{matrix} {B = {{V\;\Sigma^{1/2}M} = \begin{bmatrix} {- 0.0508} & 0.2239 & {- 2.2623} & {- 0.9378} \\ 0.5568 & {- 1.9145} & 0.0891 & 0.2198 \\ {- 0.6220} & 0.4488 & 1.1241 & {- 1.9849} \\ {- 1.1057} & 1.1097 & {- 0.0002} & 1.2931 \end{bmatrix}}} & (33) \end{matrix}$

The effective feedforward filter can be computed as:

$\begin{matrix} \begin{matrix} {{F\begin{bmatrix} F_{1} & 0 \\ 0 & F_{2} \end{bmatrix}} = {{BlockDiag}(R)}} \\ {= \begin{bmatrix} 0.2669 & 0.2024 & 0 & 0 \\ 0 & 0.2413 & 0 & 0 \\ 0 & 0 & {- 0.2281} & {- 0.0542} \\ 0 & 0 & 0 & {- 0.2050} \end{bmatrix}} \end{matrix} & (34) \end{matrix}$

Therefore, the two users employ the following feedforward filters for baseband signal processing as shown in Eq. (7).

$\begin{matrix} {{F_{1} = \begin{bmatrix} 0.2669 & 0.2024 \\ 0 & 0.2413 \end{bmatrix}},{F_{2} = \begin{bmatrix} {- 0.2281} & {- 0.0542} \\ 0 & {- 0.2050} \end{bmatrix}}} & (35) \end{matrix}$

Also, the interference pre-cancellation matrix G can be computed as:

$\begin{matrix} {G = {{FR}^{- 1} = \begin{bmatrix} 1 & 0 & {- 1.2347} & 0.2841 \\ 0 & 1 & {- 0.3447} & {- 0.1831} \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}}} & (36) \end{matrix}$

Example-2 Using Eq. (22) to Compute C

The following numerical example illustrates the computation of various matrices involved in the design of GDFE Precoder when S_(zz) is unknown. The same system as in Example-1 with transmit power fixed to 20 is assumed so that matrices H, S_(xx), V, and Σ are given by Equations (27)-(30) respectively.

Following the details outlined in B.1, compute the matrix C and its QR Decomposition:

$\begin{matrix} \begin{matrix} {C = {\left( {V\;\Sigma^{1/2}} \right)^{H}H^{- 1}}} \\ {= \underset{\underset{M}{︸}}{\begin{bmatrix} {- 0.3746} & 0.6016 & 0.4650 & 0.5306 \\ 0.3008 & {- 0.5290} & 0.0216 & 0.7932 \\ {- 0.0990} & 0.3554 & {- 0.8802} & 0.2985 \\ {- 0.8715} & {- 0.4815} & {- 0.0924} & 0.0118 \end{bmatrix}}} \\ {\underset{\underset{R}{︸}}{\begin{bmatrix} 1.8267 & 1.3854 & {- 1.9276} & {- 0.0599} \\ 0 & 1.6511 & {- 0.5381} & {- 0.3848} \\ 0 & 0 & {- 1.5611} & {- 0.3712} \\ 0 & 0 & 0 & 1.4027 \end{bmatrix}}} \end{matrix} & (37) \end{matrix}$

Next, the method computes the transmit filter matrix B as

$\begin{matrix} {B = {{V\;\Sigma^{1/2}M} = \begin{bmatrix} {- 0.0508} & 0.2239 & {- 2.2623} & 0.9378 \\ 0.5568 & {- 1.9145} & 0.0891 & {- 0.2198} \\ {- 0.6220} & 0.4488 & 1.1241 & 1.9849 \\ {- 1.1057} & 1.1097 & {- 0.0002} & {- 1.2931} \end{bmatrix}}} & (38) \end{matrix}$

Also, the effective feedforward filter is computed as:

$\begin{matrix} \begin{matrix} {{F\begin{bmatrix} F_{1} & 0 \\ 0 & F_{2} \end{bmatrix}} = {{BlockDiag}(R)}} \\ {= \begin{bmatrix} 1.8267 & 1.3854 & 0 & 0 \\ 0 & 1.6511 & 0 & 0 \\ 0 & 0 & {- 1.5611} & {- 0.3712} \\ 0 & 0 & 0 & 1.4027 \end{bmatrix}} \end{matrix} & (39) \end{matrix}$

Therefore, the two users employ the following feedforward filters for baseband signal processing as shown in Eq. (7).

$\begin{matrix} {{F_{1} = \begin{bmatrix} 1.8267 & 1.3854 \\ 0 & 1.6511 \end{bmatrix}},{F_{2} = \begin{bmatrix} {- 1.5611} & {- 0.3712} \\ 0 & 1.4027 \end{bmatrix}}} & (40) \end{matrix}$

Also, the interference pre-cancellation matrix G is computed as:

$\begin{matrix} {G = {{FR}^{- 1} = \begin{bmatrix} 1 & 0 & {- 1.2347} & {- 0.2841} \\ 0 & 1 & {- 0.3447} & 0.1831 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}}} & (41) \end{matrix}$

Example-3 Using Eq. (22) to Compute C

Consider the same system as in previous example but fix the transmit power to 10 instead of 20 as in pervious two examples. In this case, the matrices associated with the GDFE Precoder can be shown to be:

$\begin{matrix} {B = \begin{bmatrix} {- 0.1416} & 0 & {- 1.6054} & {- 0.6715} \\ 1.3873 & 0 & 0.0617 & 0.1574 \\ {- 0.5284} & 0 & 0.8176 & {- 1.4211} \\ {- 1.0834} & 0 & {- 0.0106} & 0.9258 \end{bmatrix}} & (42) \end{matrix}$

From Eq. (42), it is apparent that the 2^(nd) column of B is zero, implying that the second element in x₁ is assigned 0 transmit power. It is therefore suggested to transmit only 1 symbol to UT-1 and 2 symbols to UT-2, that is set u₁=[u₁₁ 0]^(T), u₂=[u₂₁ u₂₂]^(T) so that u=[u₁ ^(T) u₂ ^(T)]^(T). The rest of matrices associated with the GDFE precoder can be shown to be:

$\begin{matrix} {{{F_{1} = \begin{bmatrix} 0.6711 & {- 0.5106} \\ 0 & 0 \end{bmatrix}},{F_{2} = \begin{bmatrix} {- 1.1131} & {- 0.2532} \\ 0 & {- 1.0043} \end{bmatrix}}}{and}} & (43) \\ {G = \begin{bmatrix} 1 & 0 & {- 0.3246} & 0.2913 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}} & (44) \end{matrix}$

Example-4 Using Eq. (26) to Compute C

The following numerical example illustrates the computation of various matrices involved in the design of a GDFE Precoder when channel matrix H is rectangular. Consider a BS with 4 antennas and 2 users with 3 antennas each, so that channel matrices associated with both the users are of dimension 3×4. The overall channel matrix is non-square, for example:

$\begin{matrix} {H = {\begin{bmatrix} H_{1} \\ H_{2} \end{bmatrix} = \begin{bmatrix} 0.5869 & 2.3093 & 0.4855 & 0.1034 \\ {- 0.2512} & 0.5246 & {- 0.0050} & {- 0.8076} \\ 0.4801 & {- 0.0118} & {- 0.2762} & 0.6804 \\ 0.6682 & 0.9131 & 1.2765 & {- 2.3646} \\ {- 0.0783} & 0.0559 & 1.8634 & 0.9901 \\ 0.8892 & {- 1.1071} & {- 0.5226} & 0.2189 \end{bmatrix}}} & (45) \end{matrix}$

Now, for fixed transmit power of 20 the optimal input covariance matrix S_(xx) for the downlink channel can be computed using the MAC/BC duality of reference [6] and is given by:

$\begin{matrix} {S_{xx} = \begin{bmatrix} 4.6266 & 0.1030 & {- 0.0070} & {- 0.1029} \\ 0.1030 & 5.1215 & 0.0841 & {- 0.0162} \\ {- 0.0070} & 0.0841 & 5.1006 & {- 0.0201} \\ {- 0.1029} & {- 0.0162} & {- 0.0201} & 5.1513 \end{bmatrix}} & (46) \end{matrix}$

The Eigen Value Decomposition (EVD) of S_(xx) can be computed as:

$\begin{matrix} {{V = \begin{bmatrix} 0.1964 & 0.0910 & {- 0.1458} & {- 0.9653} \\ 0.6582 & {- 0.3961} & {- 0.6117} & 0.1890 \\ 0.5017 & {- 0.3846} & 0.7731 & {- 0.0510} \\ {- 0.5258} & {- 0.8288} & {- 0.0825} & {- 0.1727} \end{bmatrix}}{and}} & (47) \\ {\Sigma = \begin{bmatrix} 5.2293 & 0 & 0 & 0 \\ 0 & 5.1456 & 0 & 0 \\ 0 & 0 & 5.0375 & 0 \\ 0 & 0 & 0 & 4.5876 \end{bmatrix}} & (48) \end{matrix}$

The optimal input covariance matrix D for the equivalent Uplink/MAC channel can be computed using the methods described in reference [6] as,

$\begin{matrix} {D = \begin{bmatrix} 4.6635 & {- 0.1505} & 1.3687 & 0 & 0 & 0 \\ {- 0.1505} & 0.0049 & {- 0.0442} & 0 & 0 & 0 \\ 1.3687 & {- 0.0442} & 0.4017 & 0 & 0 & 0 \\ 0 & 0 & 0 & 5.1852 & {- 0.0224} & {- 0.0781} \\ 0 & 0 & 0 & {- 0.0224} & 5.0780 & {- 0.0875} \\ 0 & 0 & 0 & {- 0.0781} & {- 0.0875} & 4.6667 \end{bmatrix}} & (49) \end{matrix}$

Now, matrix C can be computed using Eq. (26) as,

$\begin{matrix} \begin{matrix} {C = {\left\lbrack {\sqrt{\Sigma^{\dagger}} - {\lambda\sqrt{\Sigma}}} \right\rbrack V^{H}H^{H}D}} \\ {= \underset{\underset{M}{︸}}{\begin{bmatrix} {- 0.3034} & {- 0.9436} & 0.0578 & 0.1189 \\ 0.4305 & {- 0.0129} & 0.2946 & 0.8531` \\ 0.6702 & {- 0.2708} & {- 0.6827} & {- 0.1066} \\ 0.5229 & {- 0.1899} & 0.6662 & {- 0.4968} \end{bmatrix}}} \\ {\underset{\underset{R}{︸}}{\begin{bmatrix} {- 0.2051} & 0.0066 & {- 0.0602} & 0.0298 & 0.0248 & {- 0.1351} \\ 0 & 0 & 0 & {- 0.1137} & {- 0.0494} & 0.0926 \\ 0 & 0 & 0 & {- 0.0365} & {- 0.1809} & {- 0.2138} \\ 0 & 0 & 0 & 0.1017 & {- 0.0913} & 0.1882 \end{bmatrix}}} \end{matrix} & (50) \end{matrix}$

Next, the method computes the transmit filter matrix B as

$\begin{matrix} {B = {{V\;\Sigma^{1/2}M} = \begin{bmatrix} {- 1.3479} & 0.0548 & {- 1.0671} & 1.2915 \\ {- 1.5520} & {- 1.1138} & 1.0294 & {- 0.6423} \\ 0.3822 & {- 1.5205} & {- 1.4481} & {- 0.7386} \\ {- 0.7619} & 1.2794 & {- 0.7433} & {- 1.5432} \end{bmatrix}}} & (51) \end{matrix}$

The effective feedforward filter can be computed as:

$\begin{matrix} \begin{matrix} {F = \begin{bmatrix} F_{1} & 0 \\ 0 & F_{2} \end{bmatrix}} \\ {= {{BlockDiag}(R)}} \\ {= \begin{bmatrix} {- 0.2051} & 0.0066 & {- 0.0602} & 0 & 0 & 0 \\ 0 & 0 & 0 & {- 0.1137} & {- 0.0494} & 0.0926 \\ 0 & 0 & 0 & {- 0.0365} & {- 0.1809} & {- 0.2138} \\ 0 & 0 & 0 & 0.1017 & {- 0.0913} & 0.1882 \end{bmatrix}} \end{matrix} & (52) \end{matrix}$

Therefore, the two users employ the following feedforward filters for baseband signal processing as shown in Eq. (7).

$\begin{matrix} {{F_{1} = \begin{bmatrix} {- 0.2051} & 0.0066 & {- 0.0602} \end{bmatrix}},{F_{2} = \begin{bmatrix} {- 0.1137} & {- 0.0494} & 0.0926 \\ {- 0.0365} & {- 0.1809} & {- 0.2138} \\ 0.1017 & {- 0.0913} & 0.1882 \end{bmatrix}}} & (53) \end{matrix}$

It is apparent from Equations 52 and 53, that the first user is assigned only one symbol whereas the second user is assigned 3 symbols. That is, u₁=[u₁₁], u₂=[u₂₁ u₂₂ u₂₃]^(T) so that u=[u₁ ^(T) u₂ ^(T)]^(T). The interference pre-cancellation matrix G can therefore be computed as:

$\begin{matrix} {G = {{FR}^{- 1} = \begin{bmatrix} 1 & 0.5545 & {- 0.1518} & 0.2721 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}}} & (54) \end{matrix}$

The foregoing methods provide a way to improve the spectral efficiency of MU-MIMO systems at computational costs within reasonable bounds. The performance improvements are essentially the same as those provided by more computationally complex GDFE Precoders. Thus, the methods are well-suited to high speed digital cellular telephony, including developing standards such as IMT-Advanced, and other forms of high speed digital communication, including wired communications.

The foregoing methods may be embodied in various forms and implemented as methods, processes, systems, and components such as integrated circuits. In one typical implementation, the methods are carried out in software executed by a digital signal processor.

While particular embodiments of the present invention have been shown and described, it will be obvious to those skilled in the art that, based upon the teachings herein, changes and modifications may be made without departing from this invention and its broader aspects. Therefore, the appended claims are intended to encompass within their scope all such changes and modifications as are within the true spirit and scope of this invention. 

What is claimed is:
 1. A base station comprising: a plurality of antennas which are configured to transmit a signal stream to a plurality of user terminals; and a Generalized Decision Feedback Equalizer (GDFE) precoder which is configured to produce the signal stream for the plurality of user terminals, and which includes a transmitter filter using a transmit filter matrix (B) in a feedforward path and an interference pre-cancellation using an interference pre-cancellation matrix (G) in a feedback path, wherein the transmit filter matrix (B) and the interference pre-cancellation matrix (G) are computed from a downlink channel covariance matrix (S_(xx)) and a matrix (C), and the matrix (C) is computed using a covariance matrix (D) for a corresponding multiple access channel with a channel gain matrix (H) between the plurality of antennas and the plurality of user terminals without using a noise covariance matrix (S_(zz)).
 2. The base station according to claim 1, wherein the base station is configured to compute feedforward filters (F) for each of the plurality of user terminals based on the downlink channel covariance matrix (S_(xx)) and the channel gain matrix (H).
 3. The base station according to claim 2, wherein the base station is for a multi-user multiple-input multiple-output (MU-MIMO) wireless system having k user terminals with L_(k) antennas each; wherein the feedforward filters for the user terminals are represented by F₁, F₂ . . . , F_(k) forming a feedforward filter matrix F; and wherein the GDFE precoder comprises an interference pre-cancellation block denoted by I-G disposed in the feedback path, I being an identity matrix, G being the interference pre-cancellation matrix.
 4. The base station according to claim 3, wherein the GDFE precoder further comprises: a modulo unit disposed in the feedforward path to produce a stream of filtered vector symbols X which are fed back through the interference pre-cancellation block disposed in the feedback path.
 5. The base station according to claim 4, wherein an output signal of the interference pre-cancellation block is subtracted from a stream of user symbols and applied to the modulo unit in the feedforward path.
 6. The base station according to claim 4, wherein the transmit filter represented by the transmit filter matrix B is configured to filter the stream of filtered vector symbols X produced by the modulo unit disposed in the feedforward path; wherein the transmit filter matrix B is B=VΣ ^(1/2) M, where V is a unitary matrix, M is a unitary matrix, and E is a diagonal matrix with non-negative entries; and wherein the downlink channel covariance matrix (S_(xx)) is S _(xx) =VΣV ^(H).
 7. The base station according to claim 3, wherein the interference pre-cancellation matrix G in the interference pre-cancellation block is determined by: computing the matrix C using an expression which requires computation of the downlink channel covariance matrix S_(xx), wherein the feedforward filter matrix F is represented by F=GM^(H)C, where M is a unitary matrix; computing the matrix M using QR decomposition (QRD) of C as C=MR; computing the feedforward filter matrix F as F=BlockDiagonal(R) where the BlockDiagonal(.) function extracts submatrices F₁, F₂ . . . , F_(k) of size {a_(k)×L_(k)} from block diagonals of the matrix R, and a_(k) is a number of symbols allotted to the k^(th) user terminal and equals the rank of F_(k); and computing the interference pre-cancellation matrix G as G=FR ^(†) where superscript † denotes a Moore-Penrose Generalized Inverse.
 8. The base station according to claim 7, wherein S_(xx) is computed as S _(xx) =I−[H ^(H) DH+I] ⁻¹/λ, where I is an identity matrix, the channel gain matrix H represents a channel through which communications occur in the wireless system, the covariance matrix D is an input covariance matrix for a corresponding multiple access channel in the wireless system which is chosen to be capacity optimal, and λ is a scalar variable for a given total transmit power P_(t), λ=trace(I−[H ^(H) DH+I] ⁻¹)/P _(t).
 9. The base station according to claim 3, wherein the interference pre-cancellation matrix G in the interference pre-cancellation block is determined by: computing the matrix C using the following expression C=λ(VΣ ^(1/2))^(H) H ^(†) for the channel gain matrix H whose rank is greater than or equal to its number of rows, the channel gain matrix H representing a channel through which communications occur in the wireless system, where superscript † denotes a Moore-Penrose Generalized Inverse, where V is a unitary matrix, where Σ is a diagonal matrix with non-negative entries, where λ is a scalar variable for a given total transmit power P_(t), λ=trace(I−[H ^(H) DH+I] ⁻¹)/P _(t), where I is an identity matrix, and the covariance matrix D is an input covariance matrix for a corresponding multiple access channel in the wireless system which is chosen to be capacity optimal, wherein the feedforward filter matrix F is represented by F=GM^(H)C, where M is a unitary matrix; computing the matrix M using QR decomposition (QRD) of C as C=MR; computing the feedforward filter matrix F as F=BlockDiagonal(R) where the BlockDiagonal(.) function extracts submatrices F₁, F₂ . . . , F_(k) of size {a_(k)×L_(k)} from block diagonals of the matrix R, and a_(k) is a number of symbols allotted to the k^(th) user terminal and equals the rank of F_(k); and computing the interference pre-cancellation matrix G as G=FR ^(†) where superscript † denotes a Moore-Penrose Generalized Inverse.
 10. The base station according to claim 3, wherein the interference pre-cancellation matrix G in the interference pre-cancellation block is determined by: computing the matrix C using the following expression C=(VΣ ^(1/2))^(H) H ^(†) for the channel gain matrix H whose rank is greater than or equal to its number of rows, the channel gain matrix H representing a channel through which communications occur in the wireless system, where superscript † denotes a Moore-Penrose Generalized Inverse, where V is a unitary matrix, and where Σ is a diagonal matrix with non-negative entries, wherein the feedforward filter matrix F is represented by F=GM^(H)C, where M is a unitary matrix; computing the matrix M using QR decomposition (QRD) of C as C=MR; computing the feedforward filter matrix F as F=BlockDiagonal(R) where the BlockDiagonal(.) function extracts submatrices F₁, F₂ . . . , F_(k) of size {a_(k)×L_(k)} from block diagonals of the matrix R, and a_(k) is a number of symbols allotted to the kth user terminal and equals the rank of F_(k); and computing the interference pre-cancellation matrix G as G=FR ^(†) where superscript † denotes a Moore-Penrose Generalized Inverse.
 11. A method of transmitting a signal stream to a plurality of user terminals from a plurality of antennas of a base station, the method comprising: using a Generalized Decision Feedback Equalizer (GDFE) precoder to produce the signal stream for the plurality of user terminals, the GDFE precoder including a transmitter filter using a transmit filter matrix (B) in a feedforward path and an interference pre-cancellation using an interference pre-cancellation matrix (G) in a feedback path, wherein the transmit filter matrix (B) and the interference pre-cancellation matrix (G) are computed from a downlink channel covariance matrix (S_(xx)) and a matrix (C), and the matrix (C) is computed using a covariance matrix (D) for a corresponding multiple access channel with a channel gain matrix (H) between the plurality of antennas and the plurality of user terminals without using a noise covariance matrix (S_(zz)).
 12. The method according to claim 11, further comprising: computing feedforward filters (F) for each of the plurality of user terminals based on the downlink channel covariance matrix (S_(xx)) and the channel gain matrix (H).
 13. The method according to claim 12, wherein the base station is for a multi-user multiple-input multiple-output (MU-MIMO) wireless system having k user terminals with L_(k) antennas each; wherein the feedforward filters for the user terminals are represented by F₁, F₂ . . . , F_(k) forming a feedforward filter matrix F; and wherein the GDFE precoder comprises an interference pre-cancellation block denoted by I−G disposed in the feedback path, I being an identity matrix, G being the interference pre-cancellation matrix.
 14. The method according to claim 13, wherein the GDFE precoder further includes a modulo unit disposed in the feedforward path to produce a stream of filtered vector symbols X which are fed back through the interference pre-cancellation block disposed in the feedback path.
 15. The method according to claim 14, further comprising: subtracting an output signal of the interference pre-cancellation block from a stream of user symbols and applied to the modulo unit in the feedforward path.
 16. The method according to claim 14, wherein the transmit filter represented by the transmit filter matrix B is configured to filter the stream of filtered vector symbols X produced by the modulo unit disposed in the feedforward path; wherein the transmit filter matrix B is B=VΣ ^(1/2) M, where V is a unitary matrix, M is a unitary matrix, and Σ is a diagonal matrix with non-negative entries; and wherein the downlink channel covariance matrix (S_(xx)) is S _(xx) =VΣV ^(H).
 17. The method according to claim 13, wherein the interference pre-cancellation matrix G in the interference pre-cancellation block is determined by: computing the matrix C using an expression which requires computation of the downlink channel covariance matrix (S_(xx)), wherein the feedforward filter matrix F is represented by F=GM^(H)C, where M is a unitary matrix; computing the matrix M using QR decomposition (QRD) of C as C=MR; computing the feedforward filter matrix F as F=BlockDiagonal(R) where the BlockDiagonal(.) function extracts submatrices F₁, F₂ . . . , F_(k) of size {a_(k)×L_(k)} from block diagonals of the matrix R, and a_(k) is a number of symbols allotted to the k^(th) user terminal and equals the rank of F_(k); and computing the interference pre-cancellation matrix G as G=FR ^(†) where superscript † denotes a Moore-Penrose Generalized Inverse.
 18. The method according to claim 17, wherein S_(xx) is computed as S _(xx) =I−[H ^(H) DH+I] ⁻¹/λ, where I is an identity matrix, the channel gain matrix H represents a channel through which communications occur in the wireless system, the covariance matrix D is an input covariance matrix for a corresponding multiple access channel in the wireless system which is chosen to be capacity optimal, and λ is a scalar variable for a given total transmit power P_(t), λ=trace(I−[H ^(H) DH+I] ⁻¹)/P _(t).
 19. The method according to claim 13, wherein the interference pre-cancellation matrix G in the interference pre-cancellation block is determined by: computing the matrix C using the following expression C=λ(VΣ ^(1/2))^(H) H ^(†) for the channel gain matrix H whose rank is greater than or equal to its number of rows, the channel gain matrix H representing a channel through which communications occur in the wireless system, where superscript † denotes a Moore-Penrose Generalized Inverse, where V is a unitary matrix, where Σ is a diagonal matrix with non-negative entries, where λ is a scalar variable for a given total transmit power P_(t), λ=trace(I−[H ^(H) DH+I] ⁻¹)/P _(t), where I is an identity matrix, and the covariance matrix D is an input covariance matrix for a corresponding multiple access channel in the wireless system which is chosen to be capacity optimal, wherein the feedforward filter matrix F is represented by F=GM^(H)C, where M is a unitary matrix; computing the matrix M using QR decomposition (QRD) of C as C=MR; computing the feedforward filter matrix F as F=BlockDiagonal(R) where the BlockDiagonal(.) function extracts submatrices F₁, F₂ . . . , F_(k) of size {a_(k)×L_(k)} from block diagonals of the matrix R, and a_(k) is a number of symbols allotted to the kth user terminal and equals the rank of F_(k); and computing the interference pre-cancellation matrix G as G=FR ^(†) where superscript † denotes a Moore-Penrose Generalized Inverse.
 20. The method according to claim 13, wherein the interference pre-cancellation matrix G in the interference pre-cancellation block is determined by: computing the matrix C using the following expression C=(VΣ ^(1/2))^(H) H ^(†) for the channel gain matrix H whose rank is greater than or equal to its number of rows, the channel gain matrix H representing a channel through which communications occur in the wireless system, where superscript † denotes a Moore-Penrose Generalized Inverse, where V is a unitary matrix, and where Σ is a diagonal matrix with non-negative entries, wherein the feedforward filter matrix F is represented by F=GM^(H)C, where M is a unitary matrix; computing the matrix M using QR decomposition (QRD) of C as C=MR; computing the feedforward filter matrix F as F=BlockDiagonal(R) where the BlockDiagonal(.) function extracts submatrices F₁, F₂ . . . , F_(k) of size {a_(k)×L_(k)} from block diagonals of the matrix R, and a_(k) is a number of symbols allotted to the k^(th) user terminal and equals the rank of F_(k); and computing the interference pre-cancellation matrix G as G=FR ^(†) where superscript † denotes a Moore-Penrose Generalized Inverse. 